Quantum correlations from simple assumptions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptography from Post-Quantum Assumptions

In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of weakly Random-Self-Reducible public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as weakly RandomSelf-Reducible. We introduce a new problem called Isometric Lattice P...

متن کامل

Practical Adaptive Oblivious Transfer from Simple Assumptions

In an adaptive oblivious transfer (OT) protocol, a sender commits to a database of messages and then repeatedly interacts with a receiver in such a way that the receiver obtains one message per interaction of his choice (and nothing more) while the sender learns nothing about any of the choices. Recently, there has been significant effort to design practical adaptive OT schemes and to use these...

متن کامل

Assumptions in Quantum Mechanics

This is a multi-disciplinary paper. It borrows ideas from mathemat ics, engineering software, and digital communicat ion engineering. Uncertainty principle is at the foundation of quantum mechanics. (A) It is well known that this principle is a consequence of Fourier transform (FT). The FT is based on infinity assumption. As infinity is not realistic and mean ingful in nature, and in engineerin...

متن کامل

Identity-Based Revocation from Subset Difference Methods under Simple Assumptions

Identity-based revocation (IBR) is a specific kind of broadcast encryption that can effectively send a ciphertext to a set of receivers. In IBR, a ciphertext is associated with a set of revoked users instead of a set of receivers and the maximum number of users in the system can be an exponential value in the security parameter. In this paper, we reconsider the general method of Lee, Koo, Lee, ...

متن کامل

Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions

Functional encryption (FE) enables fine-grained control of sensitive data by allowing users to only compute certain functions for which they have a key. The vast majority of work in FE has focused on deterministic functions, but for several applications such as privacy-aware auditing, differentiallyprivate data release, proxy re-encryption, and more, the functionality of interest is more natura...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2019

ISSN: 2469-9926,2469-9934

DOI: 10.1103/physreva.100.032120